Linear kernels for separating a graph into components of bounded size
نویسندگان
چکیده
منابع مشابه
Linear Kernels for Separating a Graph into Components of Bounded Size
Graph separation and partitioning are fundamental problems that have been extensively studied both in theory and practice. The p-Size Separator problem, closely related to the Balanced Separator problem, is to check whether we can delete at most k vertices in a given graph G such that each connected component of the remaining graph has at most p vertices. This problem is NP-hard for each fixed ...
متن کاملParticles Size Distribution Effect on 3d Packing of Nanoparticles Into a Bounded Region
In this paper, the effects of two different Particle Size Distributions (PSD) on packingbehavior of ideal rigid spherical nanoparticles using a novel packing model based on parallelalgorithms have been reported. A mersenne twister algorithm was used to generate pseudorandomnumbers for the particles initial coordinates. Also, for this purpose a nanosized tetragonal confinedcontainer with a squar...
متن کاملComplexity and Kernels for Bipartition into Degree-bounded Induced Graphs
In this paper, we study the parameterized complexity of the problems of partitioning the vertex set of a graph into two parts VA and VB such that VA induces a graph with degree at most a (resp., an a-regular graph) and VB induces a graph with degree at most b (resp., a b-regular graph). These two problems are called Upper-Degree-Bounded Bipartition and Regular Bipartition respectively. First, w...
متن کاملFinding all minimum-size separating vertex sets in a graph
We present a new algorithm based upon network flows for finding all minimum size separating vertex sets in an undirected graph. The sequential implementation of our algorithm runs in ®(mm(max(Mnk,knmmin(k,'In)),mQx(Mn,k2n3))) = 0 (2 kn3) time, where M is the number of minimum size separating vertex sets The parallel implementai 6 tion runs either in 0 (&logn) deterministic time using ©(M2n2 + k...
متن کاملa study of translation of english litrary terms into persian
چکیده هدف از پژوهش حاضر بررسی ترجمه ی واژه های تخصصی حوزه ی ادبیات به منظور کاوش در زمینه ی ترجمه پذیری آنها و نیز راهکار های به کار رفته توسط سه مترجم فارسی زبان :سیامک بابایی(1386)، سیما داد(1378)،و سعید سبزیان(1384) است. هدف دیگر این مطالعه تحقیق در مورد روش های واژه سازی به کار رفته در ارائه معادل های فارسی واژه های ادبی می باشد. در راستای این اهداف،چارچوب نظری این پژوهش راهکارهای ترجمه ار...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2017
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2017.04.004